SVM based Clustering Technique for Processing High Dimensional Data
نویسندگان
چکیده
منابع مشابه
Clustering High Dimensional Data Using SVM
The Web contains massive amount of documents from across the globe to the point where it has become impossible to classify them manually. This project’s goal is to find a new method for clustering documents that are as close to humans’ classification as possible and at the same time to reduce the size of the documents. This project uses a combination of Latent Semantic Indexing (LSI) with Singu...
متن کاملAn Efficient Technique for Clustering High Dimensional Data Set
In the modern world, advance technologies produce huge amount of data with many objects and dimensions. Traditional clustering algorithms do not perform well in the high dimensional data sets as similarity measures are no more meaningful, hence the data objects are equidistant from each other in high dimensions. Some traditional algorithms produce local optimum results as they start with random...
متن کاملClustering for High Dimensional Data: Density based Subspace Clustering Algorithms
Finding clusters in high dimensional data is a challenging task as the high dimensional data comprises hundreds of attributes. Subspace clustering is an evolving methodology which, instead of finding clusters in the entire feature space, it aims at finding clusters in various overlapping or non-overlapping subspaces of the high dimensional dataset. Density based subspace clustering algorithms t...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملHigh-dimensional data clustering
Clustering in high-dimensional spaces is a difficult problem which is recurrent in many domains, for example in image analysis. The difficulty is due to the fact that highdimensional data usually live in different low-dimensional subspaces hidden in the original space. This paper presents a family of Gaussian mixture models designed for highdimensional data which combine the ideas of subspace c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2004
ISSN: 1976-9172
DOI: 10.5391/jkiis.2004.14.7.816